On NP-Completeness for Linear Machines

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Turing Machines , P , NP and NP - completeness

I assume that most students have encountered Turing machines before. (Students who have not may want to look at Sipser’s book [3].) A Turing machine is defined by an integer k ≥ 1, a finite set of states Q, an alphabet Γ, and a transition function δ : Q×Γk → Q×Γk−1×{L, S,R}k where: • k is the number of (infinite, one-dimensional) tapes used by the machine. In the general case we have k ≥ 3 and ...

متن کامل

Notes on NP Completeness

Here are some notes which I wrote to try to understand what NP completeness means. Most of these notes are taken from Appendix B in Douglas West’s graph theory book, and also from wikipedia. There’s nothing remotely original about these notes. I just wanted all this material to filter through my brain and onto paper. I also wanted to collect everything together in a way I like. Here’s what thes...

متن کامل

NP - completeness Results for NONOGRAM

We introduce a new class of NP problems called ANOTHER SOLUTION PROBLEMs. For a given NP problem X, ANOTHER SOLUTION PROBLEM for X (ASP for X) is to ask, for a given instance I for X and its solution, whether there is another solution for I. The di culty of ASP for X may not be immediate from the di culty of X. For example, for some NP-complete problems such as 3SAT or 3DM, it is easy to show t...

متن کامل

Introduction to Np-completeness

We use time-bounded (deterministic and nondeterministic) Turing machines to study computational complexity of decision problems. In this model, a Turing machine has two different halting states, called the accepting state and the rejecting state, respectively. We say that a Turing machine M is bounded by time T if for any input x, M on x always halts in T (|x|) moves (steps). If M is determinis...

متن کامل

NP Completeness , Part 2

Example 1 Undirected Hamiltonian Path (UHP) and Undirected Hamiltonian Circuit (UHC) are the same problems as the corresponding problems for directed graphs, but the new problems are for undirected graphs. Claim 2 Given a polynomial time algorithm for Undirected Hamiltonian Path (UHP) there is a polynomial time algorithm for Directed Hamiltonian Path. 1. A DHP builds the triple (H, p, q), where...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 1997

ISSN: 0885-064X

DOI: 10.1006/jcom.1997.0444